Varieties of Tree Languages Definable by Syntactic Monoids
نویسنده
چکیده
An algebraic characterization of the families of tree languages definable by syntactic monoids is presented. This settles a question raised by several
منابع مشابه
Author: Saeed Salehi (Saeed @ Math.Net) Title: Varieties of Tree Languages
Trees are among the most fundamental and ubiquitous structures in mathematics. Tree languages and automata on trees have been studied extensively since the 1960s from both a purely mathematical and application point of view. When trees are defined as terms, universal algebra becomes directly applicable to tree automata and, on the other hand, the theory of tree automata suggests new notions and...
متن کاملGeneral Varieties of Tree Languages
We consider varieties of tree languages which are not restricted to a fixed ranked alphabet, varieties of finite algebras that contain algebras of all finite types, and a matching notion of varieties of congruences. A variety theorem that yields isomorphisms between the lattices formed by these three types of varieties is proved. To achieve this, some basic universal algebra is suitably general...
متن کاملVarieties of fuzzy languages
Fuzzy languages and fuzzy automata are considered using techniques from algebraic theory of automata. Syntactic monoids of fuzzy languages play a crucial role in the study. Varieties of fuzzy languages are introduced and an Eilenberg-type correspondence between varieties of fuzzy languages, varieties of ordinary languages and varieties of monoids is established.
متن کاملOn Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)
Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence related more general classes of regular languages with classes of more complex algebraic objects. Such generalized varieties also have natural counterparts formed by classes of finite automata equipped wi...
متن کاملMinimal Noncommutative Varieties and Power Varieties
A variety of finite monoids is a class of finite monoids closed under taking submonoids, quotients and finite direct products. A language L is a subset of a finitely generated free monoid. The variety theorem of Eilenberg sets up a one to one correspondence between varieties of finite monoids and classes of languages called, appropriately, varieties of languages. Recent work in variety theory h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta Cybern.
دوره 17 شماره
صفحات -
تاریخ انتشار 2005